A Methodology for Deductive Veri cation of Out - Of - OrderExecution Systems Based on Predicted Values ?

نویسنده

  • Tamarah Arons
چکیده

In this paper we propose a methodology for the deductive veriication of out-of-order scheduling algorithms. A `top-down' scheme for the systematic deenition of system invariants is deened. The complementary use of predicted values, auxiliary elds storing a dispatch time prediction of an instruction's value, is proposed as a means of further simplifying the veriication of systems in this class. We illustrate the use of thètop-down' methodology and predicted values in the veriication of three out-of-order scheduling algorithms, including a detailed discussion of the veriication of a model based on the Mips R10000.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extending the reach and power of deductive program verification

SoŸware is vital for modern society. e e›cient development of correct and reliable soŸware is of ever-growing importance. An important technique to achieve this goal is deductive program verication: the construction of logical proofs that programs are correct. In this thesis, we address three important challenges for deductive verication on its way to a wider deployment in the industry: 1. ve...

متن کامل

Decomposing, Transforming and Composing Diagrams: The Joys of Modular Veri cation

The paper proposes a modular framework for the veri cation of temporal logic properties of systems based on the deductive transformation and composition of diagrams. The diagrams represent abstractions of the modules composing the system, together with information about the environment of the modules. The proof of a temporal speci cation is constructed with the help of diagram transformation an...

متن کامل

Abstraction as the Key for Invariant Verification

ion as the Key for Invariant Veri cation Saddek Bensalem and Susanne Graf and Yassine Lakhnech VERIMAG Centre Equation avenue de Vignate F Gi eres France fbensalem graf lakhnechg imag fr Abstract We present a methodology for constructing abstractions and re ning them by analyzing counter examples We also present a uniform veri cation method that combines abstraction model checking and de ductiv...

متن کامل

Abstraction and Modular Veriication of Innnite-state Reactive Systems ?

ion and Modular Veri cation of In nite-State Reactive Systems ? Zohar Manna, Michael A. Col on, Bernd Finkbeiner, Henny B. Sipma and Tom as E. Uribe Computer Science Department Stanford University Stanford, CA. 94305-9045 [email protected] Abstract. We review a number of temporal veri cation techniques for reactive systems using modularity and abstraction. Their use allows the veri cation o...

متن کامل

Integration of Bounded Model Checking and Deductive Verification

Modular deductive veri cation of software systems is a complex task: the user has to put a lot of e ort in writing module speci cations that t together when verifying the system as a whole. In this paper, we propose a combination of deductive veri cation and software bounded model checking (SBMC), where SBMC is used to support the user in the speci cation and veri cation process, while deductiv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007